Exact Formulas for the Average Internode Distance in Mesh and Binary Tree Networks
نویسندگان
چکیده
منابع مشابه
the search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولA Novel Multicast Tree Construction Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks
Many appealing multicast services such as on-demand TV, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. When multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. Designing a good multicast tree to route data packets could enhance the...
متن کاملOn the average distance of the hypercube tree
Given a graph G on n vertices, the total distance of G is defined as σ(G) = 1 2 ∑ u,v∈V (G) d(u, v), where d(u, v) is the number of edges in a shortest path between u and v. We define the d-dimensional hypercube tree Td and show that it has a minimum total distance σ(Td) = 2σ(Hd) − ( n 2 ) = dn 2 2 − ( n 2 ) over all spanning trees of Hd, where Hd is the d-dimensional binary hypercube. It follo...
متن کاملLower bounds on the minimum average distance of binary codes
Let β(n,M) denote the minimum average Hamming distance of a binary code of length n and cardinality M. In this paper we consider lower bounds on β(n,M). All the known lower bounds on β(n,M) are useful when M is at least of size about 2n−1/n. We derive new lower bounds which give good estimations when size of M is about n. These bounds are obtained using linear programming approach. In particula...
متن کاملAverage depth in a binary search tree with repeated keys
Random sequences from alphabet {1, . . . , r} are examined where repeated letters are allowed. Binary search trees are formed from these, and the average left-going depth of the first 1 is found. Next, the right-going depth of the first r is examined, and finally a merge (or ‘shuffle’) operator is used to obtain the average depth of an arbitrary node, which can be expressed in terms of the left...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Information Technology
سال: 2013
ISSN: 2331-6063,2331-6071
DOI: 10.13189/csit.2013.010214